A simple measure of complexity

Comment I on "Simple measure for complexity"

We critique the measure of complexity introduced by Shiner, Davison, and Landsberg [Phys. Rev. E 59, 1459 (1999)]. In particular, we point out that it is over universal, in the sense that it has the same dependence on disorder for structurally distinct systems. We then give counterexamples to the claim that complexity is synonymous with being out of equilibrium: equilibrium systems can be struc...

A measure of software complexity

In recounting the e6pietls-reas-ens---ereK-£-HSC-S f-Gfour tr-a-ditional problems in developing and maintaining computer software, many authorities have mentioned complexity (e.g., References 2, 8, 15). The complexity pointed to sometimes is the inherent complexity of the jobs the computer is to do; sometimes it is the complexity of the systems or programs that direct the computer to do the job...

A Statistical Measure of Complexity

In this chapter, a statistical measure of complexity is introduced and some of its properties are discussed. Also, some straightforward applications are shown.

the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing

بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...

Sensing as a Complexity Measure